A Cooperative Switching Algorithm for Multi-Agent Foraging
نویسندگان
چکیده
منابع مشابه
A Cooperative Switching Algorithm for Multi-Agent Foraging
The foraging task is one of the canonical testbeds for cooperative robotics, in which a collection of robots have to find and transport one or more objects to specific storagepoints. Efficiency in foraging can be improved with coordinated team of robots. Swarm robotics investigates the bio-inspired behaviors of simple species, that provide complex behaviors at the group level. We present a mult...
متن کاملBee behaviour in multi-agent systems: A bee foraging algorithm
In this paper we present a new, non-pheromone-based algorithm inspired by the behaviour of biological bees. The algorithm combines both recruitment and navigation strategies. We investigate whether this new algorithm outperforms pheromone-based algorithms in the task of foraging. From our experiments, we conclude that (i) the non-pheromone-based algorithm is significantly more efficient when fi...
متن کاملExperimental Validation of a New Distributed Cooperative Control Algorithm for Multi-agent Systems with Switching Communication Topologies and Time-Delays
In this thesis, we present practical experimental results to demonstrate a control law for consensus of multiagent systems with switching topologies and time delays. The nonlinear control law utilizes discontinuous cooperative control gains and uses contraction mapping to achieve consensus of multiagent systems. The testing platform we used consists of a number of mobile robots and software sim...
متن کاملAgent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملA Generic Agent Architecture for Cooperative Multi-agent Games
The goal of this dissertation is to propose a high level generic architecture for the development of agents able to effectively play games with strong social components and a mix of competition and cooperation. Traditional techniques used in the context of games include a combination of heuristics and searching strategies like minimax, Branch & Bound as well as Monte-Carlo approaches; however, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2016
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2016.01.025